An alternating service problem

نویسنده

  • M. Vlasiou
چکیده

We consider a system consisting of a server alternating between two service points. At both service points there is an infinite queue of customers that have to undergo a preparation phase before being served. We are interested in the waiting time of the server. The waiting time of the server satisfies an equation very similar to Lindley’s equation for the waiting time in the GI/G/1 queue. We will analyse this Lindley-type equation under the assumptions that the preparation phase follows a phase type distribution while the service times have a general distribution. If we relax the condition that the server alternates between the service points, then the model turns out to be the machine repair problem. Although the latter is a well-known problem, the distribution of the waiting time of the server has not been studied yet. We shall derive this distribution under the same setting and we shall compare the two models numerically. As expected, the waiting time of the server is on average smaller in the machine repair problem than in the alternating service system, but they are not stochastically ordered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Alternating Direction Implicit Method for Modeling of Fluid Flow

This research includes of the numerical modeling of fluids in two-dimensional cavity. The cavity flow is an important theoretical problem. In this research, modeling was carried out based on an alternating direction implicit via Vorticity-Stream function formulation. It evaluates different Reynolds numbers and grid sizes. Therefore, for the flow field analysis and prove of the ability of the sc...

متن کامل

Modified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers

Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...

متن کامل

The Hamiltonian Alternating Path Problem

In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a typical working day for indoor service robots pro...

متن کامل

A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem.  At each step of ALS algorithms two convex least square problems should be solved, which causes high com...

متن کامل

Simple groups with the same prime graph as $D_n(q)$

Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017